A Homomorphic Method for Sharing Secret Images
نویسندگان
چکیده
In this paper, we present a new method for sharing images between two parties exploiting homomorphic property of public key cryptosystem. With our method, we show that it is possible to multiply two encrypted images, to decrypt the resulted image and after to extract and reconstruct one of the two original images if the second original image is available. Indeed, extraction and reconstruction of original image at the receiving end is done with the help of carrier image. Experimental results and security analysis show the effectiveness of the proposed scheme. Cryptosystem, Homomorphism, Image encryption.
منابع مشابه
Image Sharing Method Using Somewhat Homomorphic Encryption and Random Grid
In recent years, image sharing method has become a popular technique due to the characteristics of security and simplicity. However, pixel expansion and bad image contrast are two common disadvantages that must be improved. This paper proposes an image sharing method to improve the problems mentioned above. First, the homomorphic encryption is utilized to enhance the security of digital images....
متن کاملCorrigendum to "Elliptic curve ElGamal based homomorphic image encryption scheme for sharing secret images" [Signal Process. 92(2012) 1069-1078]
Corrigendum to ‘‘Elliptic curve ElGamal based homomorphic image encryption scheme for sharing secret images’’ [Signal Process. 92 (2012) 1069–1078] Li Li , Ahmed A. Abd El-Latif , Xiamu Niu a,b,n a School of Computer Science and Technology, Harbin Institute of Technology Shenzhen Graduate School, Shenzhen 518055, China b School of Computer Science and Technology, Harbin Institute of Technology,...
متن کاملApplication of homomorphism to secure image sharing
a r t i c l e i n f o In this paper, we present a new approach for sharing images between l players by exploiting the additive and multiplicative homomorphic properties of two well-known public key cryptosystems, i.e. RSA and Paillier. Contrary to the traditional schemes, the proposed approach employs secret sharing in a way that limits the influence of the dealer over the protocol and allows e...
متن کاملEfficient Bid Validity Check in ElGamal-Based Sealed-Bid E-Auction
Bid opening in sealed-bid e-auction is efficient when a homomorphic encryption algorithm is employed to seal the bids and homomorphic bid opening is employed to open the bids. Such e-auction schemes are called homomorphic auctions. However, high efficiency of homomorphic auctions is based on an assumption: the bids are valid (e.g. within a special range). An undetected invalid bid can compromis...
متن کاملSecret Sharing Homomorphism and Secure E-voting
Secure E-voting is a challenging protocol.Several approaches based on homomorphic crypto systems, mix-nets blind signatures are proposed in the literature.But most of them need complicated homomorphic encryption which involves complicated encryption decryption process and key management which is not efficient.In this paper we propose a secure and efficient E-voting scheme based on secret sharin...
متن کامل